Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing
نویسندگان
چکیده
منابع مشابه
Multisource Bayesian sequential hypothesis testing
On some probability space (Ω,F,P), let (X)t≥0, 1 ≤ i ≤ d be d independent Brownian motions with constant drifts μ(i), 1 ≤ i ≤ d, and (T (j) n , Z n )n≥1, 1 ≤ j ≤ m be m independent compound Poisson processes independent of the Brownian motions (X)t≥0, 1 ≤ i ≤ d. For every 1 ≤ j ≤ m, (T (j) n )n≥1 are the arrival times, and (Z n )n≥1 are the marks on some measurable space (E, E), with arrival ra...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملMultisource Bayesian sequential binary hypothesis testing problem
We consider the problem of testing two simple hypotheses about unknown local characteristics of several independent Brownian motions and compound Poisson processes. All of the processes may be observed simultaneously as long as desired before a final choice between hypotheses is made. The objective is to find a decision rule that identifies the correct hypothesis and strikes the optimal balance...
متن کاملReal Time Robust Template Matching
One of the most popular methods to extract useful informations from an image sequence is the template matching approach. In this well known method the tracking of a certain feature or target over time is based on the comparison of the content of each image with a sample template. In this article, we propose an efficient robust template matching algorithm that is able to track targets in real ti...
متن کاملDecentralized Sequential Hypothesis Testing in Discrete Time
In this work we deal with the problem of decentralized sequential hypothesis testing in discrete time in the case that the sensors have full local memory. We adopt the scheme called Decentralized Sequential Probability Ratio Test (D-SPRT), which entails asynchronous communication of the sensors with the fusion center at random times. We prove that the D-SPRT is asymptotically optimal and we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2008
ISSN: 0162-8828
DOI: 10.1109/tpami.2007.70794